Measures on Sat Landscapes by Statistical Exploration of Search Trees

نویسنده

  • Olivier Bailleux
چکیده

Stochastic local search methods are widely used for solving positive instances of NP-hard problems. They are based on a partial exploration of a local search landscape characterized by a nite set, a tness function and a neighborhood relation. We think that theoretical or experimental study of these landscapes, independently of search algorithms , could provide a better understanding of local search systems behaviour. In this paper, we propose a statistical method for measuring some parameters of landscapes. 1 For a given tness value, our algorithm gives the number of points with this tness, and produces a simple random sample of these points. As an example, we give estimates of local extrema proportion according to the tness for some SAT landscapes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Providing a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)

The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...

متن کامل

Effect of the Use Treated Wastewater on Microbial Contamination of Soils of Urban Landscapes

Background & objective: Microbial contamination is one of the main concerns about the use of treated wastewater in irrigation. Therefore, the present study conducted to investigate the effect of treated wastewater on microbial contamination of urban landscape soils in Zahedan. Material & methods: In this study, a 1600 m2 plot of palm trees in Zahedan were irrigated with treated wastewater and o...

متن کامل

Exploring the search space of quantum programs

Here we present a first study of search spaces and fitness landscapes in the context of the evolution of quantum programs. We consider small instances of the Deutsch-Jozsa problem as a starting point for the exploration of search spaces of quantum algorithms and analyze the structure of mutation landscapes using autocorrelation functions and information measures for characterizing their behavio...

متن کامل

Profile and Height of Random Binary Search Trees

The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.

متن کامل

treespace: Statistical exploration of landscapes of phylogenetic trees

The increasing availability of large genomic data sets as well as the advent of Bayesian phylogenetics facilitates the investigation of phylogenetic incongruence, which can result in the impossibility of representing phylogenetic relationships using a single tree. While sometimes considered as a nuisance, phylogenetic incongruence can also reflect meaningful biological processes as well as rele...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995